Postorder-traversal algorithm of binary tree based on EREW 基于EREW的后序遍历二叉树算法
This paper summarizes the relation of the three different array through the analysis of getting three different array from the same tree using three different algorithm: preorder traversal, inorder traversal and postorder traversal. 通过对同一棵二叉树的先序遍历、中序遍历、后序遍历得到三个不同序列的分析,概括出二叉树前中后序遍历序列间的关系。